Pumping lemmas for linear and nonlinear context-free languages Dedicated to Pál Dömösi on his 65th birthday
نویسندگان
چکیده
Pumping lemmas are created to prove that given languages are not belong to certain language classes. There are several known pumping lemmas for the whole class and some special classes of the context-free languages. In this paper we prove new, interesting pumping lemmas for special linear and context-free language classes. Some of them can be used to pump regular languages in two place simultaneously. Other lemma can be used to pump context-free languages in arbitrary many places.
منابع مشابه
Pumping lemmas for linear and nonlinear context-free languages
Pumping lemmas are created to prove that given languages are not belong to certain language classes. There are several known pumping lemmas for the whole class and some special classes of the context-free languages. In this paper we prove new, interesting pumping lemmas for special linear and context-free language classes. Some of them can be used to pump regular languages in two place simultan...
متن کاملSwapping Lemmas for Regular and Context-Free Languages
In formal language theory, one of the most fundamental tools, known as pumping lemmas, is extremely useful for regular and context-free languages. However, there are natural properties for which the pumping lemmas are of little use. One of such examples concerns a notion of advice, which depends only on the size of an underlying input. A standard pumping lemma encounters difficulty in proving t...
متن کاملCutting Sequences and Palindromes Jane Gilman and Linda Keen Dedicated to Bill Harvey on His 65th Birthday
We give a unified geometric approach to some theorems about primitive elements and palindromes in free groups of rank 2. The geometric treatment gives new proofs of the theorems.
متن کاملCutting Sequences and Palindromes
We give a unified geometric approach to some theorems about primitive elements and palindromes in free groups of rank 2. The geometric treatment gives new proofs of the theorems. This paper is dedicated to Bill Harvey on the occasion of his 65th birthday.
متن کاملPumping Lemma for Higher-order Languages
We study a pumping lemma for the word/tree languages generated by higher-order grammars. Pumping lemmas are known up to order-2 word languages (i.e., for regular/context-free/indexed languages), and have been used to show that a given language does not belong to the classes of regular/context-free/indexed languages. We prove a pumping lemma for word/tree languages of arbitrary orders, modulo a ...
متن کامل